0.00/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.11	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.10/0.32	% Computer   : n031.cluster.edu
0.10/0.32	% Model      : x86_64 x86_64
0.10/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.32	% Memory     : 8042.1875MB
0.10/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.32	% CPULimit   : 1200
0.10/0.32	% WCLimit    : 120
0.10/0.32	% DateTime   : Tue Jul 13 11:34:59 EDT 2021
0.10/0.32	% CPUTime    : 
0.10/0.32	% Number of cores: 8
0.10/0.32	% Python version: Python 3.6.8
0.10/0.32	# Version: 2.6rc1-ho
0.10/0.33	# No SInE strategy applied
0.10/0.33	# Trying AutoSched0 for 59 seconds
0.17/0.52	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.17/0.52	# and selection function SelectMaxLComplexAvoidPosPred.
0.17/0.52	#
0.17/0.52	# Preprocessing time       : 0.068 s
0.17/0.52	
0.17/0.52	# Proof found!
0.17/0.52	# SZS status Theorem
0.17/0.52	# SZS output start CNFRefutation
0.17/0.52	thf(def_d_not, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_d_not)).
0.17/0.52	thf(def_imp, axiom, (imp)=(^[X34:$o, X35:$o]:(X34=>X35)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_imp)).
0.17/0.52	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_all_of)).
0.17/0.52	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_is_of)).
0.17/0.52	thf(def_non, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_non)).
0.17/0.52	thf(def_l_some, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X386:$i]:(in @ X386 @ X1=>(X2 @ X386=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_l_some)).
0.17/0.52	thf(def_n_is, axiom, (n_is)=(^[X462:$i, X463:$i]:(X462)=(X463)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_is)).
0.17/0.52	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_e_is)).
0.17/0.52	thf(def_l_ec, axiom, (l_ec)=(^[X38:$o, X39:$o]:(X38=>(X39=>~$true))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_l_ec)).
0.17/0.52	thf(def_n_some, axiom, (n_some)=(^[X464:$i > $o]:(![X465:$i]:(in @ X465 @ nat=>(X464 @ X465=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_some)).
0.17/0.52	thf(def_diffprop, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_diffprop)).
0.17/0.52	thf(def_d_and, axiom, (d_and)=(^[X40:$o, X41:$o]:((X40=>(X41=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_d_and)).
0.17/0.52	thf(def_l_or, axiom, (l_or)=(^[X42:$o, X381:$o]:((X42=>~$true)=>X381)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_l_or)).
0.17/0.52	thf(def_d_29_ii, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X486:$i]:(in @ X486 @ nat=>((X1)=(n_pl @ X184 @ X486)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_d_29_ii)).
0.17/0.52	thf(def_and3, axiom, (and3)=(^[X51:$o, X52:$o, X53:$o]:((X51=>(((X52=>(X53=>~$true))=>~$true)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_and3)).
0.17/0.52	thf(def_iii, axiom, (iii)=(^[X1:$i, X185:$i]:(![X489:$i]:(in @ X489 @ nat=>((X185)=(n_pl @ X1 @ X489)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_iii)).
0.17/0.52	thf(def_moreis, axiom, (moreis)=(^[X1:$i, X187:$i]:(((![X493:$i]:(in @ X493 @ nat=>((X1)=(n_pl @ X187 @ X493)=>~$true))=>~$true)=>~$true)=>(X1)=(X187))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_moreis)).
0.17/0.52	thf(def_or3, axiom, (or3)=(^[X48:$o, X49:$o, X50:$o]:((X48=>~$true)=>((X49=>~$true)=>X50))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_or3)).
0.17/0.52	thf(def_ec3, axiom, (ec3)=(^[X54:$o, X55:$o, X56:$o]:(((X54=>(X55=>~$true))=>((((X55=>(X56=>~$true))=>((X56=>(X54=>~$true))=>~$true))=>~$true)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_ec3)).
0.17/0.52	thf(satz10c, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X235:$i]:in @ X235 @ nat) @ (^[X236:$i]:(d_not @ (iii @ X1 @ X236)<=moreis @ X1 @ X236))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz10c)).
0.17/0.52	thf(def_orec3, axiom, (orec3)=(^[X57:$o, X58:$o, X59:$o]:((((X57=>~$true)=>((X58=>~$true)=>X59))=>((((X57=>(X58=>~$true))=>((((X58=>(X59=>~$true))=>((X59=>(X57=>~$true))=>~$true))=>~$true)=>~$true))=>~$true)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_orec3)).
0.17/0.52	thf(satz10, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X191:$i]:in @ X191 @ nat) @ (^[X192:$i]:orec3 @ (n_is @ X1 @ X192) @ (d_29_ii @ X1 @ X192) @ (iii @ X1 @ X192))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz10)).
0.17/0.52	thf(c_0_22, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), inference(apply_def,[status(thm)],[def_d_not, def_imp])).
0.17/0.52	thf(c_0_23, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
0.17/0.52	thf(c_0_24, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), inference(apply_def,[status(thm)],[def_non, c_0_22])).
0.17/0.52	thf(c_0_25, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X386:$i]:(in @ X386 @ X1=>(X2 @ X386=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_some, c_0_23]), c_0_22]), c_0_24])).
0.17/0.52	thf(c_0_26, axiom, (n_is)=(^[X462:$i, X463:$i]:(X462)=(X463)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
0.17/0.52	thf(c_0_27, axiom, (l_ec)=(^[X38:$o, X39:$o]:(X38=>(X39=>~$true))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_ec, def_imp]), c_0_22])).
0.17/0.52	thf(c_0_28, axiom, (n_some)=(^[X464:$i > $o]:(![X465:$i]:(in @ X465 @ nat=>(X464 @ X465=>~$true))=>~$true)), inference(apply_def,[status(thm)],[def_n_some, c_0_25])).
0.17/0.52	thf(c_0_29, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), inference(apply_def,[status(thm)],[def_diffprop, c_0_26])).
0.17/0.52	thf(c_0_30, axiom, (d_and)=(^[X40:$o, X41:$o]:((X40=>(X41=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_d_and, c_0_22]), c_0_27])).
0.17/0.52	thf(c_0_31, plain, ![X693:$i, X703:$i]:(epred18_2 @ X703 @ X693<=>~((((X693)!=(X703)=>(![X704:$i]:(in @ X704 @ nat=>(X693)!=(n_pl @ X703 @ X704))=>~(![X705:$i]:(in @ X705 @ nat=>(X703)!=(n_pl @ X693 @ X705)))))=>(((X693)=(X703)=>![X706:$i]:(in @ X706 @ nat=>(X693)!=(n_pl @ X703 @ X706)))=>((~(![X707:$i]:(in @ X707 @ nat=>(X693)!=(n_pl @ X703 @ X707)))=>![X708:$i]:(in @ X708 @ nat=>(X703)!=(n_pl @ X693 @ X708)))=>~((~(![X709:$i]:(in @ X709 @ nat=>(X703)!=(n_pl @ X693 @ X709)))=>(X693)!=(X703)))))))), introduced(definition)).
0.17/0.52	thf(c_0_32, axiom, (l_or)=(^[X42:$o, X381:$o]:((X42=>~$true)=>X381)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_or, def_imp]), c_0_22])).
0.17/0.52	thf(c_0_33, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X486:$i]:(in @ X486 @ nat=>((X1)=(n_pl @ X184 @ X486)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_d_29_ii, c_0_28]), c_0_29])).
0.17/0.52	thf(c_0_34, axiom, (and3)=(^[X51:$o, X52:$o, X53:$o]:((X51=>(((X52=>(X53=>~$true))=>~$true)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[def_and3, c_0_30])).
0.17/0.52	thf(c_0_35, plain, ![X693:$i, X703:$i]:(epred18_2 @ X703 @ X693=>~((((X693)!=(X703)=>(![X704:$i]:(in @ X704 @ nat=>(X693)!=(n_pl @ X703 @ X704))=>~(![X705:$i]:(in @ X705 @ nat=>(X703)!=(n_pl @ X693 @ X705)))))=>(((X693)=(X703)=>![X706:$i]:(in @ X706 @ nat=>(X693)!=(n_pl @ X703 @ X706)))=>((~(![X707:$i]:(in @ X707 @ nat=>(X693)!=(n_pl @ X703 @ X707)))=>![X708:$i]:(in @ X708 @ nat=>(X703)!=(n_pl @ X693 @ X708)))=>~((~(![X709:$i]:(in @ X709 @ nat=>(X703)!=(n_pl @ X693 @ X709)))=>(X693)!=(X703)))))))), inference(split_equiv,[status(thm)],[c_0_31])).
0.17/0.52	thf(c_0_36, axiom, (iii)=(^[X1:$i, X185:$i]:(![X489:$i]:(in @ X489 @ nat=>((X185)=(n_pl @ X1 @ X489)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_iii, c_0_28]), c_0_29])).
0.17/0.52	thf(c_0_37, axiom, (moreis)=(^[X1:$i, X187:$i]:(((![X493:$i]:(in @ X493 @ nat=>((X1)=(n_pl @ X187 @ X493)=>~$true))=>~$true)=>~$true)=>(X1)=(X187))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_moreis, c_0_32]), c_0_26]), c_0_33])).
0.17/0.52	thf(c_0_38, axiom, (or3)=(^[X48:$o, X49:$o, X50:$o]:((X48=>~$true)=>((X49=>~$true)=>X50))), inference(apply_def,[status(thm)],[def_or3, c_0_32])).
0.17/0.52	thf(c_0_39, axiom, (ec3)=(^[X54:$o, X55:$o, X56:$o]:(((X54=>(X55=>~$true))=>((((X55=>(X56=>~$true))=>((X56=>(X54=>~$true))=>~$true))=>~$true)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_ec3, c_0_27]), c_0_34])).
0.17/0.52	thf(c_0_40, plain, ![X1684:$i, X1685:$i, X1688:$i, X1689:$i, X1690:$i, X1691:$i]:((((in @ (esk70_2 @ X1684 @ X1685) @ nat|in @ (esk69_2 @ X1684 @ X1685) @ nat|(X1684)=(X1685)|~epred18_2 @ X1685 @ X1684)&((X1685)=(n_pl @ X1684 @ (esk70_2 @ X1684 @ X1685))|in @ (esk69_2 @ X1684 @ X1685) @ nat|(X1684)=(X1685)|~epred18_2 @ X1685 @ X1684))&((in @ (esk70_2 @ X1684 @ X1685) @ nat|(X1684)=(n_pl @ X1685 @ (esk69_2 @ X1684 @ X1685))|(X1684)=(X1685)|~epred18_2 @ X1685 @ X1684)&((X1685)=(n_pl @ X1684 @ (esk70_2 @ X1684 @ X1685))|(X1684)=(n_pl @ X1685 @ (esk69_2 @ X1684 @ X1685))|(X1684)=(X1685)|~epred18_2 @ X1685 @ X1684)))&(((X1684)!=(X1685)|(~in @ X1688 @ nat|(X1684)!=(n_pl @ X1685 @ X1688))|~epred18_2 @ X1685 @ X1684)&((~in @ X1689 @ nat|(X1684)!=(n_pl @ X1685 @ X1689)|(~in @ X1690 @ nat|(X1685)!=(n_pl @ X1684 @ X1690))|~epred18_2 @ X1685 @ X1684)&(~in @ X1691 @ nat|(X1685)!=(n_pl @ X1684 @ X1691)|(X1684)!=(X1685)|~epred18_2 @ X1685 @ X1684)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])])])).
0.17/0.52	thf(c_0_41, negated_conjecture, ~(![X1086:$i]:(in @ X1086 @ nat=>![X1092:$i]:(in @ X1092 @ nat=>((![X1094:$i]:(in @ X1094 @ nat=>(X1086)!=(n_pl @ X1092 @ X1094))=>(X1086)=(X1092))=>![X1093:$i]:(in @ X1093 @ nat=>(X1092)!=(n_pl @ X1086 @ X1093)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz10c]), c_0_23]), c_0_22]), c_0_36]), c_0_37])])).
0.17/0.52	thf(c_0_42, axiom, (orec3)=(^[X57:$o, X58:$o, X59:$o]:((((X57=>~$true)=>((X58=>~$true)=>X59))=>((((X57=>(X58=>~$true))=>((((X58=>(X59=>~$true))=>((X59=>(X57=>~$true))=>~$true))=>~$true)=>~$true))=>~$true)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_orec3, c_0_30]), c_0_38]), c_0_39])).
0.17/0.52	thf(c_0_43, plain, ![X1:$i, X4:$i, X5:$i]:(~in @ X1 @ nat|(X4)!=(n_pl @ X5 @ X1)|(X5)!=(X4)|~epred18_2 @ X4 @ X5), inference(split_conjunct,[status(thm)],[c_0_40])).
0.17/0.52	thf(c_0_44, negated_conjecture, (in @ esk52_0 @ nat&(in @ esk53_0 @ nat&(((in @ esk54_0 @ nat|(esk52_0)=(esk53_0))&((esk52_0)=(n_pl @ esk53_0 @ esk54_0)|(esk52_0)=(esk53_0)))&(in @ esk55_0 @ nat&(esk53_0)=(n_pl @ esk52_0 @ esk55_0))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])])).
0.17/0.52	thf(c_0_45, plain, ![X693:$i]:(in @ X693 @ nat=>![X703:$i]:(in @ X703 @ nat=>epred18_2 @ X703 @ X693)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz10, c_0_23]), c_0_42]), c_0_26]), c_0_33]), c_0_36])]), c_0_31])).
0.17/0.52	thf(c_0_46, plain, ![X1:$i, X6:$i, X5:$i, X4:$i]:(~in @ X1 @ nat|(X4)!=(n_pl @ X5 @ X1)|~in @ X6 @ nat|(X5)!=(n_pl @ X4 @ X6)|~epred18_2 @ X5 @ X4), inference(split_conjunct,[status(thm)],[c_0_40])).
0.17/0.52	thf(c_0_47, plain, ![X4:$i, X1:$i]:((n_pl @ X1 @ X4)!=(X1)|~in @ X4 @ nat|~epred18_2 @ X1 @ X1), inference(er,[status(thm)],[c_0_43])).
0.17/0.52	thf(c_0_48, negated_conjecture, (esk53_0)=(n_pl @ esk52_0 @ esk55_0), inference(split_conjunct,[status(thm)],[c_0_44])).
0.17/0.52	thf(c_0_49, negated_conjecture, in @ esk55_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_44])).
0.17/0.52	thf(c_0_50, plain, ![X1482:$i, X1483:$i]:(~in @ X1482 @ nat|(~in @ X1483 @ nat|epred18_2 @ X1483 @ X1482)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])])).
0.17/0.52	thf(c_0_51, plain, ![X1:$i, X4:$i, X5:$i]:((n_pl @ (n_pl @ X1 @ X4) @ X5)!=(X1)|~epred18_2 @ (n_pl @ X1 @ X4) @ X1|~in @ X4 @ nat|~in @ X5 @ nat), inference(er,[status(thm)],[c_0_46])).
0.17/0.52	thf(c_0_52, negated_conjecture, ((esk52_0)!=(esk53_0)|~epred18_2 @ esk52_0 @ esk52_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_48]), c_0_49])])).
0.17/0.52	thf(c_0_53, plain, ![X1:$i, X4:$i]:(epred18_2 @ X4 @ X1|~in @ X1 @ nat|~in @ X4 @ nat), inference(split_conjunct,[status(thm)],[c_0_50])).
0.17/0.52	thf(c_0_54, negated_conjecture, in @ esk52_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_44])).
0.17/0.52	thf(c_0_55, negated_conjecture, ![X1:$i]:((n_pl @ esk53_0 @ X1)!=(esk52_0)|~epred18_2 @ esk53_0 @ esk52_0|~in @ X1 @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51, c_0_48]), c_0_49])])).
0.17/0.52	thf(c_0_56, negated_conjecture, in @ esk53_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_44])).
0.17/0.52	thf(c_0_57, negated_conjecture, ((esk52_0)=(n_pl @ esk53_0 @ esk54_0)|(esk52_0)=(esk53_0)), inference(split_conjunct,[status(thm)],[c_0_44])).
0.17/0.52	thf(c_0_58, negated_conjecture, (esk52_0)!=(esk53_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_53]), c_0_54])])).
0.17/0.52	thf(c_0_59, negated_conjecture, (in @ esk54_0 @ nat|(esk52_0)=(esk53_0)), inference(split_conjunct,[status(thm)],[c_0_44])).
0.17/0.52	thf(c_0_60, negated_conjecture, ![X1:$i]:((n_pl @ esk53_0 @ X1)!=(esk52_0)|~in @ X1 @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55, c_0_53]), c_0_56]), c_0_54])])).
0.17/0.52	thf(c_0_61, negated_conjecture, (n_pl @ esk53_0 @ esk54_0)=(esk52_0), inference(sr,[status(thm)],[c_0_57, c_0_58])).
0.17/0.52	thf(c_0_62, negated_conjecture, in @ esk54_0 @ nat, inference(sr,[status(thm)],[c_0_59, c_0_58])).
0.17/0.52	thf(c_0_63, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60, c_0_61]), c_0_62])]), ['proof']).
0.17/0.52	# SZS output end CNFRefutation
0.17/0.52	# Proof object total steps             : 64
0.17/0.52	# Proof object clause steps            : 18
0.17/0.52	# Proof object formula steps           : 46
0.17/0.52	# Proof object conjectures             : 16
0.17/0.52	# Proof object clause conjectures      : 13
0.17/0.52	# Proof object formula conjectures     : 3
0.17/0.52	# Proof object initial clauses used    : 9
0.17/0.52	# Proof object initial formulas used   : 22
0.17/0.52	# Proof object generating inferences   : 6
0.17/0.52	# Proof object simplifying inferences  : 14
0.17/0.52	# Training examples: 0 positive, 0 negative
0.17/0.52	# Parsed axioms                        : 351
0.17/0.52	# Removed by relevancy pruning/SinE    : 0
0.17/0.52	# Initial clauses                      : 487
0.17/0.52	# Removed in clause preprocessing      : 153
0.17/0.52	# Initial clauses in saturation        : 334
0.17/0.52	# Processed clauses                    : 614
0.17/0.52	# ...of these trivial                  : 10
0.17/0.52	# ...subsumed                          : 118
0.17/0.52	# ...remaining for further processing  : 486
0.17/0.52	# Other redundant clauses eliminated   : 254
0.17/0.52	# Clauses deleted for lack of memory   : 0
0.17/0.52	# Backward-subsumed                    : 4
0.17/0.52	# Backward-rewritten                   : 10
0.17/0.52	# Generated clauses                    : 5124
0.17/0.52	# ...of the previous two non-trivial   : 4733
0.17/0.52	# Contextual simplify-reflections      : 3
0.17/0.52	# Paramodulations                      : 4618
0.17/0.52	# Factorizations                       : 0
0.17/0.52	# NegExts                              : 6
0.17/0.52	# Equation resolutions                 : 280
0.17/0.52	# Propositional unsat checks           : 0
0.17/0.52	#    Propositional check models        : 0
0.17/0.52	#    Propositional check unsatisfiable : 0
0.17/0.52	#    Propositional clauses             : 0
0.17/0.52	#    Propositional clauses after purity: 0
0.17/0.52	#    Propositional unsat core size     : 0
0.17/0.52	#    Propositional preprocessing time  : 0.000
0.17/0.52	#    Propositional encoding time       : 0.000
0.17/0.52	#    Propositional solver time         : 0.000
0.17/0.52	#    Success case prop preproc time    : 0.000
0.17/0.52	#    Success case prop encoding time   : 0.000
0.17/0.52	#    Success case prop solver time     : 0.000
0.17/0.52	# Current number of processed clauses  : 453
0.17/0.52	#    Positive orientable unit clauses  : 98
0.17/0.52	#    Positive unorientable unit clauses: 3
0.17/0.52	#    Negative unit clauses             : 47
0.17/0.52	#    Non-unit-clauses                  : 305
0.17/0.52	# Current number of unprocessed clauses: 4437
0.17/0.52	# ...number of literals in the above   : 17587
0.17/0.52	# Current number of archived formulas  : 0
0.17/0.52	# Current number of archived clauses   : 18
0.17/0.52	# Clause-clause subsumption calls (NU) : 19251
0.17/0.52	# Rec. Clause-clause subsumption calls : 6672
0.17/0.52	# Non-unit clause-clause subsumptions  : 79
0.17/0.52	# Unit Clause-clause subsumption calls : 7454
0.17/0.52	# Rewrite failures with RHS unbound    : 2
0.17/0.52	# BW rewrite match attempts            : 49
0.17/0.52	# BW rewrite match successes           : 7
0.17/0.52	# Condensation attempts                : 0
0.17/0.52	# Condensation successes               : 0
0.17/0.52	# Termbank termtop insertions          : 125520
0.17/0.52	
0.17/0.52	# -------------------------------------------------
0.17/0.52	# User time                : 0.180 s
0.17/0.52	# System time              : 0.017 s
0.17/0.52	# Total time               : 0.197 s
0.17/0.52	# Maximum resident set size: 2148 pages
0.17/0.52	EOF